Texture analysis using graphs generated by deterministic partially self-avoiding walks
نویسندگان
چکیده
Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. & 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
Texture descriptor based on partially self-avoiding deterministic walker on networks
Texture image analysis is an important field of investigation that has attracted the attention from computer vision community in the last decades. In this paper, a novel approach for texture image analysis is proposed by using a combination of graph theory and partially self-avoiding deterministic walks. From the image, we build a regular graph where each vertex represents a pixel and it is con...
متن کاملTexture analysis using deterministic partially self-avoiding walk with thresholds
In this paper, we propose a new texture analysis method using the deterministic partially selfavoiding walk performed on maps modified with thresholds. In this method, two pixels of the map are neighbors if the Euclidean distance between them is less than √ 2 and the weight (difference between its intensities) is less than a given threshold. The maps obtained by using different thresholds highl...
متن کاملComplex network classification using partially self-avoiding deterministic walks
Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex network classification relies on the use of representative measurements that describe topological structures. Although there are a large number of measuremen...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملThe complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Valiant (SIAM J. Comput. 8 (1979) 410–421) showed that the problem of computing the number of simple s–t paths in graphs is #P-complete both in the case of directed graphs and in the case of undirected graphs. Welsh (Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge, 1993, p. 17) asked whether the problem of computing the number of self-avoiding walks of a given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 44 شماره
صفحات -
تاریخ انتشار 2011